Managing Disjunction for Practical Temporal Reasoning

نویسندگان

  • Robert Schrag
  • Mark Boday
  • Jim Carciofini
چکیده

One of the problems that must be dealt with in either a formal or implemented temporal reasoning system is the ambiguity arising from uncertain information. Lack of precise information about when events happen leads to uncertainty regarding the effects of those events. Incomplete information and nonmonotonic inference lead to situations where there is more than one set of possible inferences, even when there is no temporal uncertainty at all. In an implemented system, this ambiguity is a computational problem as well as a semantic one. In this paper, we discuss some of the sources of ~i this ambiguity, which we will treat as explicit disjunction, in the sense that ambiguous information can be interpreted as defining a set of possible inferences. We describe the application of three techniques for managing disjunction in an implementation of Dean’s Time Map Manager. Briefly, the disjunction is either: removed by limiting the expressive power of the system, explicitly represented, one disjunct at a time, or approximated by a weaker form of representation that subsumes the disjunction. We use a combination of these methods to implement an expressive and efficient temporal reasoning engine that performs sound inference in accordance with a well-defined formal semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Temporal property verification as a program analysis task - Extended Version

We describe a reduction from temporal property verification to a program analysis problem. First we present a proof system that, unlike the standard formulation, is more amenable to reasoning about infinite-state systems: disjunction is treated by partitioning, rather than enumerating, the state space and temporal operators are characterized with special sets of states called frontiers. We then...

متن کامل

Strong next-time operators for multiple-valued mu-calculus

Multiple-valued logics [2] provide an interesting alternative to classical boolean logic for modeling and reasoning about systems. By allowing additional truth values, they support the explicit modeling of uncertainty and disagreement. In order to do temporal reasoning over multiple-valued systems, we must extend a classical temporal logic to the multiple-valued case. For instance, the branchin...

متن کامل

A Temporal Description Logic for Reasoning

A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The temporal languages are members of the family of Description Logics, which are characterized by high expre...

متن کامل

Temporal equilibrium logic: a survey

After three decades of research in Nonmonotonic Reasoning (NMR), the paradigm of Answer Set Programming (ASP) [33, 30, 3] has been consolidated as one of the most prominent and successful approaches for practical knowledge representation. Great part of this success is due to the impressive advances in implementation of efficient solvers and development of applications. In this aspect, ASP shows...

متن کامل

On Constructive Linear-Time Temporal Logic

In this paper we study a version of constructive linear-time temporal logic (LTL) with the “next” temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time analysis via the Curry-Howard isomorphism. However, he did not investigate the logic itself in detail; he has proved only that the logic augmented...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992